Tool-supported Veriication of Cryptographic Protocols

The correct and awless design of cryptographic protocols is crucial for the security of network services. As security aws within such protocols are in general very hard to detect, their security properties must be formally veriied. A computer-supported prove is highly desirable, but formal techniques as well as automatic theorem provers are hard to use for a non-specialist. To ooer a user-friendly environment for verifying cryptographic protocols we developed the protocol implementation language PIL, which is very closely related to the well-known BAN logic of authentication. Our PIL compiler automatically transforms a protocol speciication into the language accepted by a theorem prover, which then performs the desired proves fully automatic. Hence, all technical details of theorem proving are hidden from the protocol designer. The paper presents the tools developed to bridge the gap between protocol design and automatic veriication.